ON WARING'S PROBLEM FOR FINITE FIELDS
نویسندگان
چکیده
منابع مشابه
On the subset sum problem over finite fields
Abstract. The subset sum problem over finite fields is a well-known NPcomplete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study the number of solutions of the subset sum problem from a mathematical point of view. In several interesting cases, we obtain explicit or asymptotic formulas for the solution number. As a consequence, we obtain some resu...
متن کاملOn the Additive Bases Problem in Finite Fields
We prove that if G is an Abelian group and A1, . . . , Ak ⊆ G satisfy mAi = G (the m-fold sumset), then A1 + · · · + Ak = G provided that k > cm log log |G|. This generalizes a result of Alon, Linial, and Meshulam [Additive bases of vector spaces over prime fields. J. Combin. Theory Ser. A, 57(2):203–210, 1991] regarding so-called additive bases.
متن کاملEvaluation Report on the Discrete Logarithm Problem over finite fields
This document is an evaluation of the discrete logarithm problem over finite fields (DLP), as a basis for designing cryptographic schemes. It relies on the analysis of numerous research papers on the subject. The present report is organized as follows: firstly, we review the DLP and several related problems such as the Diffie-Hellman problem. Next, we analyze the various algorithms that are cur...
متن کاملThe Minimum Rank Problem over Finite Fields
Let Gk(F ) = {G | mr(F,G) ≤ k}, the set of simple graphs with minimum rank at most k. The problem of finding mr(F,G) and describing Gk(F ) has recently attracted considerable attention, particularly for the case in which F = R (see [Nyl96, CdV98, JD99, Hsi01, JS02, CHLW03, vdH03, BFH04, BvdHL04, HLR04, AHK05, BD05, BFH05a, BFH05b, BvdHL05, DK06, BF07]). The minimum rank problem over R is a sub-...
متن کاملExact solutions to Waring’s problem for finite fields
with xi ∈ Fq, i.e., as a sum of kth powers of elements of Fq. We can then define the Waring function g(k, q) as the maximal number of summands needed to express all elements of Fq as sums of kth powers. We note that, by an easy argument, we have g(k, q) = g(k, q), where k = gcd(k, q − 1). Hence, we will assume from now on that k divides q − 1. Several authors have established bounds on the valu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Quarterly Journal of Mathematics
سال: 1948
ISSN: 0033-5606,1464-3847
DOI: 10.1093/qmath/os-19.1.123